A cellular automaton for blocking queen games
نویسندگان
چکیده
منابع مشابه
A Cellular Automaton Based Algorithm for Mobile Sensor Gathering
In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...
متن کاملa cellular automaton based algorithm for mobile sensor gathering
in this paper we proposed a cellular automaton based local algorithm to solve the autonomously sensor gathering problem in mobile wireless sensor networks (mwsn). in this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. the sensors decide to move only based on their local information. cellular automaton (ca) as dynamical sy...
متن کاملA Simpliied Cellular Automaton Model for City Traac a Simpliied Cellular Automaton Model for City Traac
We systematically investigate the e ect of blockage sites in a cellular automaton model for tra c ow. Di erent scheduling schemes for the blockage sites are considered. None of them returns a linear relationship between the fraction of \green" time and the throughput. We use this information for a fast implementation of a simulation of tra c in Dallas.
متن کاملAttractor vicinity decay for a cellular automaton.
The temporal decay of an attractor's vicinity for a domain-wall dominated cellular automaton (CA) is studied. Using selected initial pattern ensembles, state space structures in this high-dimensional nonlinear spatial system can be identified via the resulting decay to its attractors. Considered over a range of lattice sizes, the decay behavior falls into three main classes, each of which shows...
متن کاملA Cellular Automaton for Burgers' Equation
A bstract. We study the app roximation of solut ions to the Burgers' equation , an + c!.-(n _n 2) = v a 2 n ilt ilx 2 ilx' (1) by spatially avera ging a prob abilistic cellular automaton motivated by random walks on a line. The auto maton consists of moving "particles" on Q. one-dimensional periodic lattice with spe ed one and in a random direction subject to the exclusion principle that at mos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Natural Computing
سال: 2016
ISSN: 1567-7818,1572-9796
DOI: 10.1007/s11047-016-9581-2